Regular, inverse, and completely regular centralizers of permutations

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regular centralizers of idempotent transformations

Denote by T (X) the semigroup of full transformations on a set X. For ε ∈ T (X), the centralizer of ε is a subsemigroup of T (X) defined by C(ε) = {α ∈ T (X) : αε = εα}. It is well known that C(idX) = T (X) is a regular semigroup. By a theorem proved by J.M. Howie in 1966, we know that if X is finite, then the subsemigroup generated by the idempotents of C(idX) contains all non-invertible trans...

متن کامل

End-Completely-Regular and End-Inverse Lexicographic Products of Graphs

A graph X is said to be End-completely-regular (resp., End-inverse) if its endomorphism monoid End(X) is completely regular (resp., inverse). In this paper, we will show that if X[Y] is End-completely-regular (resp., End-inverse), then both X and Y are End-completely-regular (resp., End-inverse). We give several approaches to construct new End-completely-regular graphs by means of the lexicogra...

متن کامل

Ompactification of Completely Regular Frames based on their Cozero Part

 Let L  be a frame. We denoted the set of all regular ideals of cozL by rId(cozL) . The aim of this paper is to study these ideals. For a  frame L , we show that  rId(cozL) is a compact completely regular frame and the map jc : rId(cozL)→L  given by jc (I)=⋁I   is a compactification of L which is isomorphism to its  Stone–Čech compactification and is proved that jc have a right adjoint rc : L →...

متن کامل

Arithmetic completely regular codes

In this paper, we explore completely regular codes in the Hamming graphs and related graphs. Experimental evidence suggests that many completely regular codes have the property that the eigenvalues of the code are in arithmetic progression. In order to better understand these “arithmetic completely regular codes”, we focus on cartesian products of completely regular codes and products of their ...

متن کامل

Completely Regular Stationary Processes

We are going to give necessary and suucient conditions for a multivariate stationary stochastic process to be completely regular. We also give the answer to a question of V.V. Peller concerning the spectral measure characterization of such processes .

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematica Bohemica

سال: 2003

ISSN: 0862-7959,2464-7136

DOI: 10.21136/mb.2003.134038